Coverings of transfinite matrices

Path Coverings of Graphs and Height Characteristics of Matrices

Using graph theoretic techniques, it is shown that the height characteristic of a triangular matrix A majorizes the dual sequence of the sequence of differences of maximal cardinalities of singular k-paths in the graph G(A) of A and that in the generic case the height characteristic is equal to that dual sequence. The results on matrices are also used to prove a graph theoretic result on the du...

Transfinite Equations in Transfinite Strings

Transfinite Diameter

The transfinite diameter is a way of quantifying the size of compact sets in Euclidean space. This quantity is related to the Hausdorff dimension and the Lebesgue measure, but gives a slightly different perspective on the set than either of those do. In this paper, we introduce the transfinite diameter, and outline some attempts to calculate this quantity for three sets in R. For z1, z2, . . . ...

Transfinite rewriting

We survey the basic concepts and properties of transfinite rewriting for orthogonal term rewrite systems, lambda calculus, higher-order rewrite systems, and abstract rewrite systems.

On category of co-coverings

In this article, we introduce the concept of co-covering which is the dual of covering concept. Then, we prove several theorems being similar to the theorems that have been de-veloped for the covering concept. For example, we provide the lifting criterion for co-coverings of a topological space X, which helps us to classify them by subgroups of the group of all homeomorphisms of X.